Provenance and Temporally Annotated Logic Programming
نویسندگان
چکیده
منابع مشابه
Provenance and Temporally Annotated Logic Programming
In this paper, we consider provenance and temporally annotated logic rules (pt-logic rules, for short), which are definite logic programming rules associated with the name of the source that they originate and the temporal interval during which they are valid. A collection of pt-logic rules form a provenance and temporally annotated logic program P, called pt-logic program, for short. We develo...
متن کاملTemporally Annotated Extended Logic Programs
Extended logic programs (ELPs) are a set of logic rules with strong negation allowed in the bodies or head of the rules and weak negation ~ allowed in the bodies of the rules. ELPs enable for various forms of reasoning that cannot be achieved by definite logic programs. Answer Set Programming provides a widely acceptable semantics for ELPs. However, ELPs do not provide information regarding t...
متن کاملTemporal Annotated Constraint Logic Programming
We introduce a family of logics and associated programming languages for representing and reasoning about time. The family is conceptually simple while allowing for different models of time. Formulas can be labeled with temporal information using annotations. In this way we avoid the proliferation of variables and quantifiers as encountered in first order approaches. Unlike temporal logic, both...
متن کاملAbduction in Annotated Logic Programming
Pragmatically, the logk programming paradigm presents a reasonable trade-off between expressive power and computational efficiency [9, 141. Here, we investigate techniques to make it more expressive for knowledge representation, while simultaneously retaining the computational advantages of efficiency and simplicity. In Section 1.1, we review annotated logic programs. In Section 1.2, we motivat...
متن کاملSemantics for Temporal Annotated Constraint Logic Programming
We investigate semantics of a considerable subset of Temporal Annotated Constraint Logic Programming (TACLP), a class of languages that allows us to reason about qualitative and quantitative, definite and indefinite temporal information using time points and time periods as labels for atoms. After illustrating the power of TACLP with some non-trivial examples, TACLP is given two different kinds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Research in Artificial Intelligence
سال: 2012
ISSN: 2165-4069,2165-4050
DOI: 10.14569/ijarai.2012.010703